A 1.75-approximation algorithm for unsigned translocation distance
نویسندگان
چکیده
منابع مشابه
A 1.75-Approximation Algorithm for Unsigned Translocation Distance
The translocation operation is one of the popular operations for genome rearrangement. In this paper, we present a 1.75approximation algorithm for computing unsigned translocation distance which improves upon the best known 2-approximation algorithm [J. Kececioglu, R. Ravi, Of mice and men: Algorithms for evolutionary distances between genomes with translocation, in: 6th ACM–SIAM Symposium on D...
متن کاملA ð1:5þ Þ-Approximation Algorithm for Unsigned Translocation Distance
Genome rearrangement is an important area in computational biology and bioinformatics. The translocation operation is one of the popular operations for genome rearrangement. It was proved that computing the unsigned translocation distance is NP-hard. In this paper, we present a ð1:5þ Þ-approximation algorithm for computing the unsigned translocation distance that improves upon the best known 1....
متن کاملOn the complexity of unsigned translocation distance
Translocation is one of the basic operations for genome rearrangement. Translocation distance is the minimum number of translocations required to transform one genome into the other. In this paper, we show that computing the translocation distance for unsigned genomes is NP-hard. Moreover, we show that approximating the translocation distance for unsigned genomes within ratio 1.00017 is NP-hard...
متن کاملA Novel Algorithm for Digital Distance Relaying
Distance relays are used to protect EHV and HV Transmission lines. Over the past decades many algorithms have emerged for digital distance relays. These are based on the calculation of the transmission line impedance from the relaying to fault points. In this paper a novel method for digital distance relaying is proposed. In the method the tracking procedure is implemented. The method uses the ...
متن کاملA Novel Algorithm for Digital Distance Relaying
Distance relays are used to protect EHV and HV Transmission lines. Over the past decades many algorithms have emerged for digital distance relays. These are based on the calculation of the transmission line impedance from the relaying to fault points. In this paper a novel method for digital distance relaying is proposed. In the method the tracking procedure is implemented. The method uses the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2007
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2007.03.009